翻訳と辞書 Words near each other ・ Lampolai ・ Lampoldshausen ・ Lampona ・ Lamponeia ・ Lamponia ・ Lamponidae ・ Lampoon ・ Lamporecchio ・ Lamporo ・ Lamport ・ Lamport (surname) ・ Lamport Hall ・ Lamport railway station ・ Lamport signature ・ Lamport Stadium ・ Lamport timestamps ・ Lamport's bakery algorithm ・ Lamport's distributed mutual exclusion algorithm ・ Lamport, Buckinghamshire ・ Lamport, Northamptonshire ・ Lampos ・ Lampra (moth) ・ Lamprantaugia ・ Lampranthus ・ Lampranthus aurantiacus ・ Lampranthus roseus ・ Lampranthus sociorum ・ Lampranthus tenuifolius ・ Lampre ・ Lampre-Merida Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Lamport timestamps ： ウィキペディア英語版 Lamport timestamps The algorithm of Lamport timestamps is a simple algorithm used to determine the order of events in a distributed computer system. As different nodes or processes will typically not be perfectly synchronized, this algorithm is used to provide a partial ordering of events with minimal overhead, and conceptually provide a starting point for the more advanced vector clock method. They are named after their creator, Leslie Lamport. Distributed algorithms such as resource synchronization often depend on some method of ordering events to function. For example, consider a system with two processes and a disk. The processes send messages to each other, and also send messages to the disk requesting access. The disk grants access in the order the messages were sent. Now, imagine process 1 sends a message to the disk asking for access to write, and then sends a message to process 2 asking it to read. Process 2 receives the message, and as a result sends its own message to the disk. Now, due to some timing delay, the disk receives both messages at the same time: how does it determine which message happened-before the other? ($A$ happens-before $B$ if one can get from $A$ to $B$ by a sequence of moves of two types: moving forward while remaining in the same process, and following a message from its sending to its reception.) A logical clock algorithm provides a mechanism to determine facts about the order of such events. Lamport invented a simple mechanism by which the happened-before ordering can be captured numerically. A Lamport logical clock is an incrementing software counter maintained in each process. It follows some simple rules: # A process increments its counter before each event in that process; # When a process sends a message, it includes its counter value with the message; # On receiving a message, the receiver process sets its counter to be the maximum of the message counter and its own counter (already incremented due to rule 1), before it considers the message received. Conceptually, this logical clock can be thought of as a clock that only has meaning in relation to messages moving between processes. When a process receives a message, it resynchronizes its logical clock with that sender. ==Considerations== For every two different events $a$ and $b$ occurring in the same process, and $C(x)$ being the timestamp for a certain event $x$, it is necessary that $C(a)$ never equals $C(b)$. Therefore it is necessary that: # The logical clock be set so that there is minimum of one clock "tick" (increment of the counter) between events $a$ and $b$; # In a multiprocess or multithreaded environment, it might be necessary to attach the process ID (PID) or any other unique ID to the timestamp so that it is possible to differentiate between events $a$ and $b$ which may occur simultaneously in different processes. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Lamport timestamps」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.